منابع مشابه
Lattice gases and cellular automata
We review the class of cellular automata known as lattice gases, and their applications to problems in physics and materials science. The presentation is selfcontained, and assumes very little prior knowledge of the subject. Hydrodynamic lattice gases are emphasized, and non-lattice-gas cellular automata – even those with physical applications – are not treated at all. We begin with a review of...
متن کاملFrom Quantum Cellular Automata to Quantum Lattice Gases
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial...
متن کاملExploring and Exploiting Quantum-Dot Cellular Automata
The Full Adders (FAs) constitute the essential elements of digital systems, in a sense that they affect the circuit parameters of such systems. With respect to the MOSFET restrictions, its replacement by new devices and technologies is inevitable. QCA is one of the accomplishments in nanotechnology nominated as the candidate for MOSFET replacement. In this article 4 new layouts are presente...
متن کاملEntropy and Chaos in a Lattice Gas Cellular Automata
We find a simple linear relation between the thermodynamic entropy and the largest Lyapunov exponent (LLE) of an discrete hydrodynamical system, a deterministic, two-dimensional lattice gas automaton (LGCA). This relation can be extended to irreversible processes considering the Boltzmann’s H function and the expansion factor of the LLE. The definition of LLE for cellular automata is based on t...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 1999
ISSN: 0167-739X
DOI: 10.1016/s0167-739x(99)00045-x